An Efficient SISO Algorithm for Reed-Solomon Codes
نویسندگان
چکیده
There has been renewed interest in iterative decoding algorithms for concatenated codes since the introduction of Turbo codes. Such iterative methods are built on top of soft-insoft-out algorithms. Powerful concatenated codes may be constructed with linear block codes codes as constituent codes. Such codes can be better alternatives to Turbo Codes either when high coding rates or when short interleaver lengths are required. This paper presents a computationally efficient maximum a-posteriori (MAP) soft-in-soft-out (SISO) algorithm for RS codes and related codes.
منابع مشابه
Soft-in soft-out decoding of Reed-Solomon codes based on Vardy and Be'ery's decomposition
This correspondence presents an optimal soft-in soft-out (SISO) decoding algorithm for the binary image of Reed–Solomon (RS) codes that is based on Vardy and Be’ery’s optimal soft-in hard-out algorithm. A novel suboptimal list-based SISO decoder that exploits Vardy and Be’ery’s decomposition is also presented. For those codes with very high rate, which allows practical decoding with the propose...
متن کاملEfficient algorithms for decoding Reed-Solomon codes with erasures
In this paper, we present a new algorithm for decoding Reed-Solomon codes with both errors and erasures. The algorithm combines an efficient method for solving the Key Equation and a technique which separates the error locator polynomial from the erasure locator polynomial. The new algorithm is compared to two other efficient Reed-Solomon decoding algorithms and shown to be significantly faster...
متن کاملEfficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes
A list decoding for an error-correcting code is a decoding algorithm that generates a list of codewords within a Hamming distance from the received vector, where can be greater than the error-correction bound. In [18], a list-decoding procedure for Reed–Solomon codes [19] was generalized to algebraic–geometric codes. A recent work [8] gives improved list decodings for Reed–Solomon codes and alg...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملA class of Sudan-decodable codes
In this correspondence, Sudan’s algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed–Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons wi...
متن کامل